Delay-sensitive Internet Of Things Applications Research Articles

An Efficient and Autonomous Planning Scheme for Deploying IoT Services in Fog Computing: A Metaheuristic-Based Approach

The fog computing paradigm is a promising concept to overcome the exponential increase in data volume in Internet of Things (IoT) applications. This paradigm can support delay-sensitive IoT applications by extending cloud services to the network edge. However, fog computing faces challenges such as resource allocation for applications at the network edge due to limited resources as well as its heterogeneous and distributed nature. This is in line with the goals of microservice architecture and develops the placement of microservice-based IoT applications. The IoT service placement problem (SPP) on fog nodes is known as non-deterministic polynomial-time (NP)-hard. In this study, we introduce a meta-heuristic approach named SPP-differential evolution algorithm (DEA) to handle SPP, which originates from the DEA with a shared parallel architecture. The proposed method takes advantage of the scalable and deployable nature of microservices to minimize the resource utilization and delay as much as possible. SPP-DEA is developed based on monitoring, analysis, decision-making, and execution with knowledge bas (MADE-k) autonomous planning model with the aim of compromise between service cost, response time, resource utilization, and throughput. In order to address the computational complexity of the problem, we consider the resource consumption distribution and service deployment priority in the placement process. In order to evaluate the quality of placement in SPP-DEA, extensive experiments have been performed on a synthetic fog environment. The simulation results show that compared to the state-of-the-art approaches, SPP-DEA reduces the service cost and waiting time by 16% and 11%, respectively.

Edge–Cloud Collaborative Computation Offloading for Mixed Traffic

Edge computing can avoid long network transmission delay, thus reducing the task response time. However, edge servers cannot respond quickly to massive computing requests due to limited computing power, which may lead to long queuing delays, thus failing to meet low latency requirements of delay-sensitive Internet of Things (IoT) applications. Furthermore, the per-computing-unit energy consumption in edge computing is much higher than that in cloud computing. This article studies the edge–cloud collaborative computing for energy efficiency while meeting the delay requirements of IoT applications in mobile edge computing systems. We formulate the energy efficient computation offloading problem for mixed tasks, including divisible and indivisible tasks. We theoretically analyze the relationship between delay guarantee and energy consumption in edge–cloud collaborative environment. We further analyze the system stability based on Lyapunov stability theory. Then, an energy efficient and delay guaranteed edge–cloud collaborative computation offloading algorithm is proposed to provide delay guarantee for delay-sensitive IoT applications while minimizing the energy consumption of the edge–cloud computing system. Theoretical analysis and experimental results show that, compared with the benchmark algorithms, our algorithm can provide strict delay guarantee for stringent-delay-sensitive IoT applications, and low delay for soft-delay-sensitive IoT applications, while consuming lower energy.

Dynamic Offloading Technique for Latency-Sensitive Internet of Things Applications using Fog Computing

Internet of Things (IoT) has evolved as a novel paradigm that provides com-putation power to different entities connected to it. IoT offers services to multiple sectors such as home automation, industrial automation, traffic management, healthcare sector, agriculture industry etc. IoT generally relies on cloud data centers for extended analytics, processing and storage support. The cloud offers highly scalable and robust platform for IoT applications. But latency sensitive IoT applications suffer delay issues as the cloud lies in remote location. Edge/fog computing was introduced to overcome the issues faced by delay-sensitive IoT applications. These platforms lie close to the IoT network, reducing the delay and response time. The fog nodes are usually distributed in nature. The data has to be properly offloaded to available fog nodes using efficient strategies to gain benefit from the integration. Differ-ent offloading schemes are available in the literature to overcome this prob-lem This paper proposes a novel offloading approach by combining two effi-cient metaheuristic algorithms, Honey Badger Algorithm (HBA) and Fla-mingo Search Algorithm (FSA) termed as HB-FS algorithm. The HB-FS is executed in an iterative manner optimizing the objective function in each it-eration. The performance evaluation of the proposed approach is done with different existing metaheuristic algorithms and the evaluations show that the proposed work outperforms the existing algorithms in terms of latency, response time and execution time. The methodology also offers better degree of imbalance with proper load balancing under different conditions.

DECO: A Deadline-Aware and Energy-Efficient Algorithm for Task Offloading in Mobile Edge Computing

With the rapid development in the area of Internet of Things (IoT), the number of delay-sensitive and power-hungry IoT applications has drastically increased over the past few years. Mobile edge computing (MEC) has become an effective computing model for meeting the IoT applications’ requirements. However, the resource-constrained nature of the IoT devices, different characteristics of IoT tasks such as delay sensitivity, and heterogeneity of the edge cloud servers (ECSs) make the task offloading problem a fundamental challenge in the MEC systems. Motivated by this, in this article, we propose a deadline-aware and energy-efficient computation offloading algorithm, DECO, for scheduling and processing the generated tasks from the IoT devices. The proposed algorithm jointly takes into account the deadline requirement of the tasks and the energy consumption of the IoT devices in the local decision-making process. Also, it considers the priority of the tasks and heterogeneity of ECSs for the task-node mapping process. The extensive simulation results confirm that the proposed algorithm improves the deadline satisfaction ratio of delay-sensitive tasks about 85.4% and reduces their average response time up to 62.9% compared to the state-of-the-art method while the amount of increase in the total energy consumption of IoT devices is less than 13.4%.

AI-Empowered Fast Task Execution Decision for Delay-Sensitive IoT Applications in Edge Computing Networks

As the number of smart connected devices increases day by day, a massive amount of tasks are generated by various types of Internet of Things (IoT) devices. Intelligent edge computing is a promising enabler in next-generation wireless networks to execute these tasks on proximate edge servers instead of smart devices. Additionally, regarding the execution of tasks in edge servers, smart devices could provide a low-latency environment to the end users. Within this paper, an artificial intelligence (AI)-empowered fast task execution method in heterogeneous IoT applications is proposed to reduce decision latency by taking into account different system parameters such as the execution deadline of the task, battery level of devices, channel conditions between mobile devices and edge servers, and edge server capacity. In edge computing scenarios, the number of task requests, resource constraints of edge servers, mobility of connected devices, and energy consumption are the main performance considerations. In this paper, the AI-empowered fast task decision method is proposed to solve the multi-device edge computing task execution problem by formulating it as a multi-class classification problem. The extensive simulation results demonstrate that the proposed framework is extremely fast and precise in decision-making for offloading computation tasks compared to the conventional Lyapunov optimization-based algorithm results by ensuring the guaranteed quality of experience.

Delay Optimal Schemes for Internet of Things Applications in Heterogeneous Edge Cloud Computing Networks.

Over the last decade, the usage of Internet of Things (IoT) enabled applications, such as healthcare, intelligent vehicles, and smart homes, has increased progressively. These IoT applications generate delayed- sensitive data and requires quick resources for execution. Recently, software-defined networks (SDN) offer an edge computing paradigm (e.g., fog computing) to run these applications with minimum end-to-end delays. Offloading and scheduling are promising schemes of edge computing to run delay-sensitive IoT applications while satisfying their requirements. However, in the dynamic environment, existing offloading and scheduling techniques are not ideal and decrease the performance of such applications. This article formulates joint and scheduling problems into combinatorial integer linear programming (CILP). We propose a joint task offloading and scheduling (JTOS) framework based on the problem. JTOS consists of task offloading, sequencing, scheduling, searching, and failure components. The study’s goal is to minimize the hybrid delay of all applications. The performance evaluation shows that JTOS outperforms all existing baseline methods in hybrid delay for all applications in the dynamic environment. The performance evaluation shows that JTOS reduces the processing delay by 39% and the communication delay by 35% for IoT applications compared to existing schemes.

Statistical Learning-Based Grant-Free Access for Delay-Sensitive Internet of Things Applications

Mission-critical Internet-of-Things (IoT) applications require communication interfaces that provide ultra-reliability and low latency. Acquiring knowledge regarding the number of active devices and their latency-reliability requirements becomes essential to optimize resource allocation in heterogeneous networks. Due to the inherent heavy computation overheads, the conventional centralized decision-making approaches result in large latency. The distributed computing and device-level prediction of network parameters can play a significant role in designing mission-critical IoT applications operating in dynamic environments. This paper considers the medium access control (MAC) layer of heterogeneous networks employing a framed-ALOHA-based restricted transmission strategy to enhance reliability. We present a statistical learning-based device-level network exploration mechanism in which end-devices use their transmission history to predict different network parameters. The IoT devices share the learned parameters with the base station (BS) to identify different groups presented in the network. The simulation results show that the mean square error (MSE) in predicting different network parameters can be reduced by increasing the history window size. In this regard, the optimal size of the history window under the given accuracy constraints is also determined. We demonstrate that the proposed device-level network load prediction mechanism is more robust as compared to the BS-centered approach.

Maximizing User Service Satisfaction for Delay-Sensitive IoT Applications in Edge Computing

The Internet of Things (IoT) technology provisions unprecedented opportunities to evolve the interconnection among human beings. However, the latency brought by unstable wireless networks and computation failures caused by limited resources on IoT devices prevents users from experiencing high efficiency and seamless user experience. To address these shortcomings, the integrated Mobile Edge Computing (MEC) with remote clouds is a promising platform to enable delay-sensitive service provisioning for IoT applications, where edge-clouds (cloudlets) are co-located with wireless access points in the proximity of IoT devices. Thus, computation-intensive and sensing data from IoT devices can be offloaded to the MEC network immediately for processing, and the service response latency can be significantly reduced. In this paper, we first formulate two novel optimization problems for delay-sensitive IoT applications, i.e., the total utility maximization problems under both static and dynamic offloading task request settings, with the aim to maximize the accumulative user satisfaction on the use of the services provided by the MEC, and show the NP-hardness of the defined problems. We then devise efficient approximation and online algorithms with provable performance guarantees for the problems in a special case where the bandwidth capacity constraint is negligible. We also develop efficient heuristic algorithms for the problems with the bandwidth capacity constraint. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising in reducing service delays and enhancing user satisfaction, and the proposed algorithms outperform their counterparts by at least 10.8 percent.

Service Provisioning for Multi-source IoT Applications in Mobile Edge Computing

We are embracing an era of Internet of Things (IoT). The latency brought by unstable wireless networks caused by limited resources of IoT devices seriously impacts the quality of services of users, particularly the service delay they experienced. Mobile Edge Computing (MEC) technology provides promising solutions to delay-sensitive IoT applications, where cloudlets (edge servers) are co-located with wireless access points in the proximity of IoT devices. The service response latency for IoT applications can be significantly shortened due to that their data processing can be performed in a local MEC network. Meanwhile, most IoT applications usually impose Service Function Chain (SFC) enforcement on their data transmission, where each data packet from its source gateway of an IoT device to the destination (a cloudlet) of the IoT application must pass through each Virtual Network Function (VNF) in the SFC in an MEC network. However, little attention has been paid on such a service provisioning of multi-source IoT applications in an MEC network with SFC enforcement. In this article, we study service provisioning in an MEC network for multi-source IoT applications with SFC requirements and aiming at minimizing the cost of such service provisioning, where each IoT application has multiple data streams from different sources to be uploaded to a location (cloudlet) in the MEC network for aggregation, processing, and storage purposes. To this end, we first formulate two novel optimization problems: the cost minimization problem of service provisioning for a single multi-source IoT application, and the service provisioning problem for a set of multi-source IoT applications, respectively, and show that both problems are NP-hard. Second, we propose a service provisioning framework in the MEC network for multi-source IoT applications that consists of uploading stream data from multiple sources of the IoT application to the MEC network, data stream aggregation and routing through the VNF instance placement and sharing, and workload balancing among cloudlets. Third, we devise an efficient algorithm for the cost minimization problem built upon the proposed service provisioning framework, and further extend the solution for the service provisioning problem of a set of multi-source IoT applications. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrate that the proposed algorithms are promising.

Secure Computation Offloading in Blockchain Based IoT Networks With Deep Reinforcement Learning

For current and future Internet of Things (IoT) networks, mobile edge-cloud computation offloading (MECCO) has been regarded as a promising means to support delay-sensitive IoT applications. However, offloading mobile tasks to the cloud gives rise to new security issues due to malicious mobile devices (MDs). How to implement offloading to alleviate computation burdens at MDs while guaranteeing high security in mobile edge cloud is a challenging problem. In this paper, we investigate simultaneously the security and computation offloading problems in a multi-user MECCO system with blockchain. First, to improve the offloading security, we propose a trustworthy access control mechanism using blockchain, which can protect cloud resources against illegal offloading behaviours. Then, to tackle the computation management of the authorized MDs, we formulate a computation offloading problem by jointly optimizing the offloading decisions, the allocation of computing resource and radio bandwidth, and smart contract usage. This optimization problem aims to minimize the long-term system costs of latency, energy consumption and smart contract fee among all MDs. To solve the proposed offloading problem, we develop an advanced deep reinforcement learning algorithm using a double-dueling Q-network. Evaluation results from real experiments and numerical simulations demonstrate the significant advantages of our scheme over the existing approaches.

Online Distributed Offloading and Computing Resource Management With Energy Harvesting for Heterogeneous MEC-Enabled IoT

With the rapid development and convergence of the mobile Internet and the Internet of Things (IoT), computing-intensive and delay-sensitive IoT applications (APPs) are proliferating with an unprecedented speed in recent years. Mobile edge computing (MEC) and energy harvesting (EH) technologies can significantly improve the user experience by offloading computation tasks to edge-cloud servers as well as achieving green and durable operation. Traditional centralized strategies require precise information of system states, which may not be feasible in the era of big data and artificial intelligence. To this end, how to allocate limited edge-cloud computing resource on demand, and how to develop heterogeneous task offloading strategies with EH in a more flexible manner are remaining challenges. In this paper, we investigate an EH-enabled MEC offloading system, and propose an online distributed optimization algorithm based on game theory and perturbed Lyapunov optimization theory. The proposed algorithm works online and jointly determines heterogeneous task offloading, on-demand computing resource allocation, and battery energy management. Furthermore, to reduce the unnecessary communication overhead and improve the processing efficiency, an offloading pre-screening criterion is designed by balancing battery energy level, latency, and revenue. Extensive simulations are carried out to validate the effectiveness and rationality of the proposed approach.

Mitigating Conflicting Transactions in Hyperledger Fabric-Permissioned Blockchain for Delay-Sensitive IoT Applications

Blockchain is a promising emerging technology that is envisioned to play a key role in establishing secure and reliable Internet-of-Things (IoT) ecosystems without the involvement of any third party. Hyperledger Fabric, a permissioned blockchain system that can yield high throughput and low consensus delay, has shown its capability in enhancing security and privacy protection for delay-sensitive IoT services. The literature, however, has not considered the conflicting transaction problem which may substantially limit the system performance and degrade QoS for the end users. In this article, we propose CATP-Fabric, a new blockchain system to address the conflicting transaction problem by reducing the number of potentially conflicting transactions with less overhead. First, the transactions within a block are divided into different groups to facilitate parallel transaction processing. Then, CATP-Fabric filters stale transactions and prioritizes the read-only transactions in each group to eliminate unnecessary overhead. Finally, we formulate the selection of aborting transactions in CATP-Fabric as a binary integer-programming problem and develop a low-complexity optimization algorithm to minimize the number of aborted transactions. Illustrative results show that our proposed CATP-Fabric blockchain system achieves high throughput of successful transactions while maintaining a lower aborting transaction rate compared to the benchmark blockchain systems.

Link Resource Allocation Strategy Based on Age of Information and Sample Extrusion Awareness in Dynamic Channels

As an emerging measure of data freshness, the age of information (AoI) is receiving extensive attention. Many methods using AoI have been proposed for communication scheduling in the Internet of Things (IoT). However, most of them are aimed at constant channel conditions in the ideal state, and the utilization of link resources is not sufficient. In addition, only the optimization of AoI is considered, without considering whether the sample is extruded. Sample extrusion refers to the scenario in which the transmission of the remaining untransmitted sample of the source node cannot be completed within the transmission time interval (TTI) before the arrival of the new sampling period of the source node. Thus, sample extrusion is a phenomenon that occurs when the new sample arrives while the old sample has not yet been completely transmitted. This scenario has a serious impact on delay-sensitive IoT applications. Therefore, under dynamic channel conditions and limited link resources, this paper establishes two mathematical models for AoI and sample extrusion. The influence of the scheduling algorithm on these two target values is analyzed and proven. Based on a greedy strategy, we propose a preemptive online algorithm for link resource allocation that considers two objectives: to give full play to the value of link resources and to minimize sample extrusion. The simulation results show that the proposed strategy can achieve better comprehensive performance in both scenarios where the sample variance between source nodes is small or large.

Integrating Edge Computing into Low Earth Orbit Satellite Networks: Architecture and Prototype

Low Earth Orbit (LEO) satellite network is a cost-efficient way to achieve global covering for wide-area Internet of Things (IoT). As more and more IoT applications require large amounts of computing resources, cloud computing paradigm becomes one of the IoT’s main enablers. Abundant resources can be used to execute computation-intensive IoT applications in the cloud. Moreover, edge computing has emerged to alleviate the high latency and low bandwidth problem of cloud computing. The integration of edge computing into LEO networks (which is called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">LEC</i> in this paper) can improve satellite IoT network’s performance. In addition, it is an effective way to support delay-sensitive and resource-hungry wide-area IoT applications. However, there are many technical challenges for LEC, which is different from edge computing in terrestrial networks. Therefore, we study LEC in depth and a novel system architecture is proposed. A LEC prototype system is implemented which verifies our design. The simulation result demonstrates that LEC can improve system performance compared with cloud computing in LEO networks.

Ensemble Deep Learning Assisted VNF Deployment Strategy for Next-Generation IoT Services

Due to the massive Internet of Things (IoT) connectivity and substantial growth of communication traffic, Virtual Network Function (VNF) orchestration scheme is anticipated to function promptly, dynamically, and intelligently for next-generation networks. Hence, we urge the necessity to move beyond the traditional paradigm and employ VNFs on the network edge located cloudlet. Overall, multi-access edge computing can intensify the performance of delay-sensitive IoT applications compared to the core cloud based VNF deployments. In this paper, we intend to investigate how to simultaneously leverage the ensembling of multiple deep learning models for proper calibration to provide real-time VNF placement solutions. We also address the challenges associated with state-of-the-art approaches to deal with dynamic network traffic and topology patterns. Our envisioned methods, based on Convolutional Neural Networks and Artificial Neural Networks named as E-ConvNets and E-ANN respectively, suggest two proactive VNF deployment strategies. These ensembled VNF deployment strategies demonstrate encouraging performance (optimality gap nearly 7%) in terms of minimizing relocation and communication costs, and high scalability intelligence factor (around 0.93) through simulation results compared to standalone deep learning models. Furthermore, the presented results indicate the potentialities of applying deep learning-based strategies into similar research enigmas for future telecommunication network researches.

Scalable edge cloud platforms for IoT services

Nowadays, online applications are moving to the cloud, and for delay-sensitive ones, the cloud is being extended with edge/fog domains. Emerging cloud platforms that tightly integrate compute and network resources enable novel services, such as versatile IoT (Internet of Things), augmented reality or Tactile Internet applications. Virtual infrastructure managers (VIMs), network controllers and upper-level orchestrators are in charge of managing these distributed resources. A key and challenging task of these orchestrators is to find the proper placement for software components of the services. As the basic variant of the related theoretical problem (Virtual Network Embedding) is known to be NP-hard, heuristic solutions and approximations can be addressed. In this paper, we propose two architecture options together with proof-of-concept prototypes and corresponding embedding algorithms, which enable the provisioning of delay-sensitive IoT applications. On the one hand, we extend the VIM itself with network-awareness, typically not available in today's VIMs. On the other hand, we propose a multi-layer orchestration system where an orchestrator is added on top of VIMs and network controllers to integrate different resource domains. We argue that the large-scale performance and feasibility of the proposals can only be evaluated with complete prototypes, including all relevant components. Therefore, we implemented fully-fledged solutions and conducted large-scale experiments to reveal the scalability characteristics of both approaches. We found that our VIM extension can be a valid option for single-provider setups encompassing even 100 edge domains (Points of Presence equipped with multiple servers) and serving a few hundreds of customers. Whereas, our multi-layer orchestration system showed better scaling characteristics in a wider range of scenarios at the cost of a more complex control plane including additional entities and novel APIs (Application Programming Interfaces).

A Survey on Routing Protocols for Delay and Energy-Constrained Cognitive Radio Networks

The ever-growing demand for higher network data rates, lower delay, and conservative energy consumption at reduced costs, to support Internet-of-things (IoT) communications, has pushed wireless technologies into a new frontier. The growing demand for such technologies can be attributed to several factors, such as the massive number of the upcoming bandwidth-hungry IoT applications and the enormous number of - often battery-powered - devices expected to connect to the network. Cognitive Radio Networks (CRNs) can play a significant role in future generations of mobile-communication technologies by providing dynamic access to underutilized licensed bands. However, battery-operated devices, which communicate delay-sensitive data over multihop links, impose serious energy-delay limits. In such CRN-based IoT communications, as one device depletes its energy, network disconnectivity may arise, which can degrade the network efficiency. Therefore, building a reactive routing protocol to recover from any sudden link breakage is necessary to maintain prolonged network connectivity. This paper provides a comprehensive survey of CRN routing protocols that are based on two essential metrics, namely, packet delay, energy consumption, or both, while excluding all other CRN routing protocols. The survey is meant to support the designers of future CRN-based IoT communication frameworks with a detailed comparative survey, which targets the most relevant proposed routing protocols, including the specifics of the routing metrics, implemented spectrum awareness strategy, and employed medium-access control standard along with the simulator tool used for performance evaluation. In addition, this survey finds that the majority of cognitive radio routing protocols address either delay or energy consumption, but only a few consider a joint delay-energy metric, which suits delay-sensitive IoT applications running on energy-constrained devices.

A Volunteer-Supported Fog Computing Environment for Delay-Sensitive IoT Applications

Fog computing (FC) has emerged as a complementary solution to the centralized cloud infrastructure. An FC node is available in closer proximity to users and extends cloud services to the edge of the network in a highly distributed manner. However, with an increase in streaming and delay-sensitive Internet-of-Things (IoT) applications, FC also needs to address the issue of higher latency while forwarding compute-intensive jobs to remote cloud data centers. Hence, there is a need to investigate the use of computational resources at the edge of the network. Volunteer computing (VC) offers a reduction in the cost of maintaining high-performance computing by making use of user-owned underutilized or idle resources, e.g., laptops and desktop computers closer to fog devices. We propose volunteer-supported FC (VSFC), as a computing paradigm, that explores the interplay of these two distributed computing domains to help minimize inherent communication delays of cloud computing, energy consumption, and network usage. To this effect, we have extended the iFogSim toolkit to support VSFC. Extensive simulations show that VSFC outperforms traditional FC-cloud computing by reducing delay by 47.5%, energy by 93%, and network usage by 92% under normal to heavy load conditions.

Online Workload Allocation via Fog-Fog-Cloud Cooperation to Reduce IoT Task Service Delay.

Fog computing has recently emerged as an extension of cloud computing in providing high-performance computing services for delay-sensitive Internet of Things (IoT) applications. By offloading tasks to a geographically proximal fog computing server instead of a remote cloud, the delay performance can be greatly improved. However, some IoT applications may still experience considerable delays, including queuing and computation delays, when huge amounts of tasks instantaneously feed into a resource-limited fog node. Accordingly, the cooperation among geographically close fog nodes and the cloud center is desired in fog computing with the ever-increasing computational demands from IoT applications. This paper investigates a workload allocation scheme in an IoT–fog–cloud cooperation system for reducing task service delay, aiming at satisfying as many as possible delay-sensitive IoT applications’ quality of service (QoS) requirements. To this end, we first formulate the workload allocation problem in an IoT-edge-cloud cooperation system, which suggests optimal workload allocation among local fog node, neighboring fog node, and the cloud center to minimize task service delay. Then, the stability of the IoT-fog-cloud queueing system is theoretically analyzed with Lyapunov drift plus penalty theory. Based on the analytical results, we propose a delay-aware online workload allocation and scheduling (DAOWA) algorithm to achieve the goal of reducing long-term average task serve delay. Theoretical analysis and simulations have been conducted to demonstrate the efficiency of the proposal in task serve delay reduction and IoT-fog-cloud queueing system stability.

A Feature-Based Learning System for Internet of Things Applications

In many applications of Internet of Things (IoT), the huge amount of data are generated by sensor nodes and processing them are complex. Offloading data classification and anomaly event detection tasks to sink nodes in sensor networks can reduce the computing complexity, lower remote communication loads, and improve the response time for the delay-sensitive IoT applications. Many existing classification and anomaly detection methods cannot be directly applied to these IoT applications, because the computing and energy resources of sensors are limited. In this paper, a new feature-based learning system for IoT applications is proposed to effectively classify data and detect anomaly event. Especially, based on the theory of distributed compression, the sparsity and relativity of the data are exploited to obtain the classification features, which can reduce the computation overhead and energy consumption. Further, an RBF-BP hybrid neural network is employed to detect the anomaly event based on the classification results, by which the training time of neural network can be significantly reduced and the accuracy can be improved for users’ decisions.